Automata to Perform Computations

نویسندگان

  • Melanie Mitchell
  • Rajarshi Das
چکیده

We describe an application of genetic algorithms GAs to the design of cellular automata CAs that can perform computations requiring global coordination A GA was used to evolve CAs for two computational tasks density classi cation and synchronization In both cases the GA discovered rules that gave rise to sophisticated emergent computational strategies These strategies can be analyzed using a computational mechanics framework in which particles carry information and interaction between particles e ects information processing This framework can also be used to explain the process by which the strategies are designed by the GA This work is a rst step in employing GAs to engineer useful emergent computation in decentralized multi processor systems

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evolutionary Methods for 2-D Cellular Automata Computation

This paper describes methods for evolving 2-D cellular automata to perform global computations. This is a difficult task because global behaviors must arise from local computations of many parallel cells. We present the results of numerous tests involving different genetic algorithm methods to perform the 2-D equivalent of classic 1-D CA tasks, including density classification and synchronizati...

متن کامل

Non-Uniform Cellular Automata a Review Non-Uniform Cellular Automata a Review

This tutorial intends to present an introduction to non-uniform cellular automata (CA). The difference between uniform cellular automata and non-uniform ones is that in uniform CA all cells share the same rule, or set of rules, in non-uniform CA this is not true, every cell can have a different sets of rules or even no rule at all. We will see here that this single difference increases the powe...

متن کامل

The Evolutionary Design of Collective Computation in Cellular Automata

We investigate the ability of a genetic algorithm to design cellular automata that perform computations. The computational strategies of the resulting cellular automata can be understood using a framework in which “particles” embedded in space-time configurations carry information and interactions between particles effect information processing. This structural analysis can also be used to expl...

متن کامل

Lattice Gas Automata Simulation of Adsorption Process of Polymer in Porous Media

Lattice gas automata (LGA) model is developed to simulate polymer adsorption process by adding some collision rules. The simulation result of the model is matched with batch experiment and compared with accepted isothermal adsorption equations. They show that the model is viable to perform simulation of the polymer adsorption process. The LGA model is then applied for simulating continuous poly...

متن کامل

Co-evolving Non-uniform Cellular Automata to Perform Computations

A major impediment of cellular automata (CA) stems from the diiculty of utilizing their complex behavior to perform useful computations. Recent studies by Packard, 1988, Mitchell et al., 1994b] have shown that CAs can be evolved to perform a computational task. In this paper non-uniform CAs are studied, where each cell may contain a diierent rule, in contrast to the original, uniform model. We ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001